package 无重复字符的最长子串;

import javax.jnlp.IntegrationService;
import java.util.HashMap;

//滑动窗口
public class Solution1 {
    public int lengthOfLongestSubstring(String s) {
        if(s.length()== 0) return 0;
        int max = 0;
        int left = 0;
        HashMap<Character, Integer> map = new HashMap<>();
        for (int i = 0; i < s.length(); i++) {
            if(map.containsKey(s.charAt(i))){
               left = Math.max(left,map.get(s.charAt(i)+1));
            }
            map.put(s.charAt(i),i);
            max = Math.max(max,i-left+1);
        }
        return max;
    }
}
